Knowledge and Tree-Edits in Learnable Entailment Proofs
نویسندگان
چکیده
This paper describes BIUTEE Bar Ilan University Textual Entailment Engine. BIUTEE is a natural language inference system in which the hypothesis is proven by the text, based on linguisticand worldknowledge resources, as well as syntactically motivated tree transformations. The main progress in BIUTEE in the last year is a new confidence model that estimates the validity of the proof found by BIUTEE.
منابع مشابه
Recognizing Textual Entailment for Italian EDITS @ EVALITA 2009
This paper overviews FBK’s participation in the Textual Entailment task at EVALITA 2009. Our runs were obtained through different configurations of EDITS (Edit Distance Textual Entailment Suite), the first freely available open source tool for Recognizing Textual Entailment (RTE). With a 71% Accuracy, EDITS reported the best score out of the 8 submitted runs. We describe the sources of knowledg...
متن کاملA Confidence Model for Syntactically-Motivated Entailment Proofs
This paper presents a novel method for recognizing textual entailment which derives the hypothesis from the text through a sequence of parse tree transformations. Unlike related approaches based on tree-edit-distance, we employ transformations which better capture linguistic structures of entailment. This is achieved by (a) extending an earlier deterministic knowledge-based algorithm with synta...
متن کاملEDITS: An Open Source Framework for Recognizing Textual Entailment
This paper overviews FBK’s participation in the RTE 5 Evaluation Campaign. Our runs, submitted both to the main (two-way classification), and to the pilot task, were obtained through different configurations of EDITS (Edit Distance Textual Entailment Suite) package, the first freely available open source RTE software. The main sources of knowledge used, the different configurations, and the ach...
متن کاملTree Edit Models for Recognizing Textual Entailments, Paraphrases, and Answers to Questions
We describe tree edit models for representing sequences of tree transformations involving complex reordering phenomena and demonstrate that they offer a simple, intuitive, and effective method for modeling pairs of semantically related sentences. To efficiently extract sequences of edits, we employ a tree kernel as a heuristic in a greedy search routine. We describe a logistic regression model ...
متن کاملNatural logic and natural language inference
We propose a model of natural language inference which identifies valid inferences by their lexical and syntactic features, without full semantic interpretation. We extend past work in natural logic, which has focused on semantic containment and monotonicity, by incorporating both semantic exclusion and implicativity. Our model decomposes an inference problem into a sequence of atomic edits lin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011